on Mathematical and Computing Sciences : TR - C 195 title : An Error Bound for the Pseudo Expectation : 1 D Case
نویسنده
چکیده
title: An Error Bound for the Pseudo Expectation: 1D Case author: Osamu Watanabe and Johannes Schneider affiliation: Dept. of Mathematical and Computing Sciences, Tokyo Institute of Technology W8-25, Tokyo 152-8552 email: [email protected] acknowledgments to financial supports: Supported in part by a Grant-in-Aid for Scientific Research on Priority Areas “Statical-Mechanical Approach to Probabilistic Information Processing” 2002-2005.
منابع مشابه
FUZZY INTEGRO-DIFFERENTIAL EQUATIONS: DISCRETE SOLUTION AND ERROR ESTIMATION
This paper investigates existence and uniqueness results for the first order fuzzy integro-differential equations. Then numerical results and error bound based on the left rectangular quadrature rule, trapezoidal rule and a hybrid of them are obtained. Finally an example is given to illustrate the performance of the methods.
متن کاملon Mathematical and Computing Sciences : TR - C 146 title : An Improved Randomized Algorithm for 3 - SAT author :
Schöning [Sch99] proposed a simple yet efficient randomized algorithm for solving the k-SAT problem. His analysis showed that for 3-SAT, finding a satisfying assignment of any satisfiable formula F with n variables can be achieved in poly(n) · (4/3) (= poly(n) · (1.3333)) expected time, which is optimal up to now. In this paper, we improve this expected time bound by using a combination of a de...
متن کاملA Bound for the Nilpotency Class of a Lie Algebra
In the present paper, we prove that if L is a nilpotent Lie algebra whose proper subalge- bras are all nilpotent of class at most n, then the class of L is at most bnd=(d 1)c, where b c denotes the integral part and d is the minimal number of generators of L.
متن کاملon Mathematical and Computing Sciences : TR - C 186 title : The Complexity of Routing Strategies in Update Networks
An update game is a new model for studying networks and infinite duration processes. In this paper we analyze routing strategies in (bipartite) update networks. We show that any routing strategy, both independent of a relying graph and with advice, uses a space of size at least the logarithm of the number of vertices. We also present a nearly optimal strategy with advice to this lower bound.
متن کاملApplication of fractional-order Bernoulli functions for solving fractional Riccati differential equation
In this paper, a new numerical method for solving the fractional Riccati differential equation is presented. The fractional derivatives are described in the Caputo sense. The method is based upon fractional-order Bernoulli functions approximations. First, the fractional-order Bernoulli functions and their properties are presented. Then, an operational matrix of fractional order integration...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008